Ascent concordance
نویسندگان
چکیده
A cobordism between links in thickened surfaces consists of a surface $ S and $3$-manifold $M $, with properly embedded M \times I $. We show that there exist such if $(S,M) is them which simple, then must be complex. That is, are cases low complexity the does not imply $3$-manifold. Specifically, we concordant concordance can only realised by passing through thickenings higher genus surfaces. exhibit an infinite family detected elementary method other families detectable this way. investigate augmented version Khovanov homology, use it to detect these families. Such provide counterexamples analogue Slice-Ribbon conjecture.
منابع مشابه
Recursive Ascent-Descent Parsing
Generalized left-corner parsing was originally presented as a technique for generating a parser for the SLR(1) class of grammars but with far fewer states than the SLR(1) parser. This paper modi es and extends the formulation of left-corner parsers so that it is possible to apply the technique to the LALR(1) and LR(1) classes of grammars. It is further shown that left-corner parsers can be conv...
متن کاملCPS Recursive Ascent Parsing
The parsing problem is ubiquitous in Computer Science. Perhaps that is part of the reason it has been used so frequently to illustrate the power of continuations and monads. It is often the case, though, that the parser examples of continuation passing style and monads are top-down parsers. I intend to show that the continuation passing style of programming naturally leads to bottom-up or recur...
متن کاملSteepest Ascent Tariff Reforms
This paper introduces the concept of a steepest ascent tariff reform for a small open economy. By construction, it is locally optimal in that it yields the highest gain in utility of any feasible tariff reform vector of the same length. Accordingly, it provides a convenient benchmark for the evaluation of the welfare effectiveness of other tariff reform proposals. We develop the properties of t...
متن کاملThe gentlest ascent dynamics
Dynamical systems that describe the escape from the basins of attraction of stable invariant sets are presented and analysed. It is shown that the stable fixed points of such dynamical systems are the index-1 saddle points. Generalizations to high index saddle points are discussed. Both gradient and non-gradient systems are considered. Preliminary results on the nature of the dynamical behaviou...
متن کاملGradient Ascent Critic Optimization
In this paper, we address the critic optimization problem within the context of reinforcement learning. The focus of this problem is on improving an agent’s critic, so as to increase performance over a distribution of tasks. We use ordered derivatives, in a process similar to back propagation through time, to compute the gradient of an agent’s fitness with respect to its reward function. With e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic & Geometric Topology
سال: 2021
ISSN: ['1472-2739', '1472-2747']
DOI: https://doi.org/10.2140/agt.2021.21.3073